Locating Global Critical Slip Surface Using the Morgenstern-Price Method and Simulated Annealing Algorithm
نویسندگان
چکیده
منابع مشابه
Optimization of Time, Cost, and Quality in Critical Chain Method Using Simulated Annealing (RESEARCH NOTE)
In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملLINE-SEGMENTS CRITICAL SLIP SURFACE IN EARTH SLOPES USING AN OPTIMIZATION METHOD
In this paper the factor of safety (FS) and critical line-segments slip surface obtained by the Alternating Variable Local Gradient (AVLG) optimization method was presented as a new topic in 2D. Results revealed that the percentage of reduction in the FS obtained by switching from a circular shape to line segments was higher with the AVLG method than other methods. The 2D-AVLG optimization meth...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملSolving Bus Terminal Location Problem Using Simulated Annealing Method
Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Materials Science and Engineering
سال: 2017
ISSN: 2572-889X
DOI: 10.12783/dtmse/ictim2017/9984